Connexive Logic, Probabilistic Default Reasoning, and Compound Conditionals

Abstract We present two approaches to investigate the validity of connexive principles and related formulas properties within coherence-based probability logic. Connexive logic emerged from intuition that conditionals form if not - A , then should hold, since conditional’s antecedent contradicts its consequent . Our cover this by observing only coherent assessment on conditional event $${A| \overline{A}}$$ A | ¯ is $${p(A| \overline{A})=0}$$ p ( ) = 0 In first approach we probabilistic default reasoning, interpreting defaults negated in terms suitable constraints events. second study connexivity coherence framework compound conditionals, random quantities. After developing notions each approach, analyze following principles: Aristotle’s theses Second Thesis Abelard’s First Principle Boethius’ also deepen generalize some further (like non-symmetry ). Both satisfy minimal requirements for a Finally, compare both conceptually.